闘本 4.1 ノード間の経路
提出
code: txt
visited = set()
while queue:
next = queue.pop()
if next == target:
returun True
else:
queue.add(g
next
)